On the Expressiveness of TPTL and MTL over \omega-Data Words
نویسندگان
چکیده
Metric Temporal Logic (MTL) and Timed Propositional Temporal Logic (TPTL) are prominent extensions of Linear Temporal Logic to specify properties about data languages. In this paper, we consider the class of data languages of non-monotonic data words over the natural numbers. We prove that, in this setting, TPTL is strictly more expressive than MTL. To this end, we introduce Ehrenfeucht-Fraı̈ssé (EF) games for MTL. Using EF games for MTL, we also prove that the MTL definability decision problem (“Given a TPTL-formula, is the language defined by this formula definable in MTL?”) is undecidable. We also define EF games for TPTL, and we show the effect of various syntactic restrictions on the expressiveness of MTL and TPTL.
منابع مشابه
On the Expressiveness of TPTL and MTL over ω-Data Words
Metric Temporal Logic (MTL) and Timed Propositional Temporal Logic (TPTL) are prominent extensions of Linear Temporal Logic to specify properties about data languages. In this paper, we consider the class of data languages of non-monotonic data words over the natural numbers. We prove that, in this setting, TPTL is strictly more expressive than MTL. To this end, we introduce Ehrenfeucht-Fraı̈ssé...
متن کاملThe expressive power, satisfiability and path checking problems of MTL and TPTL over non-monotonic data words
Recently, verification and analysis of data words have gained a lot of interest. Metric temporal logic (MTL) and timed propositional temporal logic (TPTL) are two extensions of Linear time temporal logic (LTL). In MTL, the temporal operator are indexed by a constraint interval. TPTL is a more powerful logic that is equipped with a freeze formalism. It uses register variables, which can be set t...
متن کاملOn the Expressiveness of TPTL and MTL
TPTL and MTL are two classical timed extensions of LTL. In this paper, we positively answer a 15-year-old conjecture that TPTL is strictly more expressive than MTL. But we show that, surprisingly, the TPTL formula proposed in [4] for witnessing this conjecture can be expressed in MTL. More generally, we show that TPTL formulae using only the F modality can be translated into MTL.
متن کاملP . Bouyer , F . Chevalier and N . Markey About the Expressiveness of TPTL and MTL Research Report LSV - 05 - 05 May 2005
TPTL and MTL are two classical timed extensions of LTL. In this paper, we answer a 15 year old conjecture that TPTL is strictly more expressive than MTL. But we show that, surprisingly, the TPTL formula proposed in [AH90] for witnessing this conjecture can be expressed in MTL. More generally, we show that TPTL formulae using only the F modality can be translated into MTL.
متن کاملPath Checking for MTL and TPTL over Data Words
Precise complexity results are derived for the model checking problems for MTL (metric temporal logic) and TPTL (timed propositional temporal logic) on (in)finite data words and deterministic one-counter machines. Depending on the number of register variables and the encoding of numbers in constraints (unary or binary), the complexity is either P-complete or PSPACE-complete.
متن کامل